Automatic Data Distribution for Nearest Neighbor Networks

An algorithm for mapping an arbitrary multidimen sional array onto an arbitrarily shaped multidimen sional nearest neighbor network of a distributed mem ory machine is presented The individual dimensions of the array are labeled with high level usage descrip tors that can either be provided by the programmer or can be derived by sophisticated static compiler analy sis The presented algorithm achieves an appropriate exploitation of nearest neighbor communication and allows for e cient address calculations We describe the integration of this technique into an optimizing compiler for Modula and derive ex tensions that render e cient translation of nested par allelism possible and provide some support for thread scheduling